Derived Markov Chains. II

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirical Bayes Estimation in Nonstationary Markov chains

Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical  Bayes estimators  for the transition probability  matrix of a finite nonstationary  Markov chain. The data are assumed to be of  a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...

متن کامل

Transient calculations on process algebra derived Markov chains

The process of obtaining transient measures from a Markov chain as implemented in the software, ipclib is described. The software accepts models written in PEPA, Bio-PEPA or as a Petri net. In the case of the process algebras, a rich query specification language particularly well suited for the derivation of passage-time quantiles is provided. Such measurements are obtained from the derived Mar...

متن کامل

Tree-valued Markov Chains Derived from Galton-watson Processes

Let G be a Galton-Watson tree, and for 0 u 1 let Gu be the subtree of G obtained by retaining each edge with probability u. We study the tree-valued Markov process (Gu; 0 u 1) and an analogous process (G u; 0 u 1) in which G 1 is a critical or subcritical Galton-Watson tree conditioned to be in nite. Results simplify and are further developed in the special case of Poisson( ) o spring distribut...

متن کامل

Markov chains

[Tip: Study the MC, QT, and Little's law lectures together: CTMC (MC lecture), M/M/1 queue (QT lecture), Little's law lecture (when deriving the mean response time from mean number of customers), DTMC (MC lecture), M/M/1 queue derivation using DTMC analysis, derive distribution of response time in M/M/1 queue (QT lecture), relation between Markov property and mem-oryless property (MC lecture), ...

متن کامل

Inequalities for Rare Events in Time-reversible Markov Chains Ii

A previous paper discussed explicit bounds in the exponential approximation for the distribution of the waiting time until a stationary reversible Markov chain rst enters a \rare" subset of states. In this paper Stein's method is used to get explicit (but complicated) bounds on the Poisson approximation for the number of non-adjacent visits to a rare subset.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Indagationes Mathematicae (Proceedings)

سال: 1962

ISSN: 1385-7258

DOI: 10.1016/s1385-7258(62)50007-3